課程大綱

課程資訊

課程名稱	離散數學 Discrete Mathematics
開課學期	106-2
授課對象	電機工程學系
授課教師	雷欽隆
課號	EE2008
課程識別碼	901E21100
班次	02
學分	2.0
全/半年	半年
必/選修	必修
上課時間	星期二7,8(14:20~16:20)
上課地點	博理112
備註	本課程以英語授課。本系學生優先修習總人數上限：60人
Ceiba 課程網頁	http://ceiba.ntu.edu.tw/1062dm
課程簡介影片
核心能力關聯	核心能力與課程規劃關聯圖
課程大綱
為確保您我的權利,請尊重智慧財產權及不得非法影印
課程概述	1. Mathematical Reasoning Logic, Proof methods, Inductive Proofs 2. Combinatorial Analysis Summations, Countability, Probability, Combinatorics, Recurrences, Boolean Algebra 3. Discrete Structures Sets, Functions, Sequences, Permutations, Relations, Graphs, Trees, Finite-state Machines 4. Algorithms Orders of Growth, Complexity. Specification, Program verification 5. Application and modeling Model of Computation
課程目標	1. To teach mathematical reasoning and problem solving rather than ad-hoc approaches so that students can think logically and mathematically 2. Guide students to learn how to attack problems 3. To help students develop the skills needed for their further studies.
課程要求	Prerequisite: None Grading: 1. Homework Assignments 30 % 2. Midterm 30 % 3. Final exam 40 %
預期每週課後學習時數
Office Hours	另約時間
指定閱讀
參考書目	Textbook： Discrete Mathematics and Its Applications 7th Edition Kenneth H. Rosen McGraw-Hill, 2011
評量方式 (僅供參考)

課程進度

週次	日期	單元主題
Week 1	2/27	Overview Propositional Logic
Week 2	3/6	Predicate Logic
Week 3	3/13	Logic and Proofs
Week 4	3/20	Basic Structures
Week 5	3/27	Basic Structures Homework #1 due
Week 6	4/3	Study day (adjusted holiday)
Week 7	4/10	Basic Structures / Algorithms
Week 8	4/17	Algorithms
Week 9	4/24	Midterm Exam.
Week 10	5/1	Recurrence Relations
Week 11	5/8	Homework #2 due Recurrence Relations
Week 12	5/15	Number Theory & Cryptography
Week 13	5/22	Number Theory & Cryptography
Week 14	5/29	Induction & Recursion Homework #3 due
Week 15	6/5	Counting
Week 16	6/12	Advanced Counting
Week 17	6/19	RelationsGraphsTrees
Week 18	6/26	Final Exam.